Distributed cryptographic function application protocols

نویسندگان

  • André Postma
  • Thijs Krol
  • Egbert Molenkamp
چکیده

Recovery of data stored in a fault-tolerant and secure way requires encryption and / or decryption of data with secret cryptographic functions, for which a group of processors should be responsible. For this purpose, the here-introduced distributed cryptographic function application protocols (DCFAPs) can be applied. DCFAPs are executed on a set, N , of N processors, in order to apply a secret cryptographic function F, while satisfying the following properties: ❏ malicious behaviour of up to T processors from N does not inhibit application of F ❏ any group of N-T or more processors from N is capable of applying F ❏ T or fewer colluding processors from N are unable to compute or apply F.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Security protocols over open networks and distributed systems: formal methods for their analysis, design, and verification

Formal methods, theory, and supporting tools can aid the design, analysis, and verification of the security-related and cryptographic protocols used over open networks and distributed systems. The most commonly followed techniques for the application of formal methods for the ex-post analysis and verification of cryptographic protocols, as the analysis approach, are reviewed, followed by the ex...

متن کامل

Distributed Smooth Projective Hashing and its Application to Two-Server PAKE

Smooth projective hash functions have been used as building block for various cryptographic applications, in particular for password-based authentication. In this work we propose the extended concept of distributed smooth projective hash functions where the computation of the hash value is distributed across n parties and show how to instantiate the underlying approach for languages consisting ...

متن کامل

Pii: S0140-3664(99)00030-4

Formal methods, theory, and supporting tools can aid the design, analysis, and verification of the security-related and cryptographic protocols used over open networks and distributed systems. The most commonly followed techniques for the application of formal methods for the ex-post analysis and verification of cryptographic protocols, as the analysis approach, are reviewed, followed by the ex...

متن کامل

Non-Determinism in Byzantine Fault-Tolerant Replication

Service replication distributes an application over many processes for tolerating faults, attacks, and misbehavior among a subset of the processes. With the recent interest in blockchain technologies, distributed execution of one logical application has become a prominent topic. The established statemachine replication paradigm inherently requires the application to be deterministic. This paper...

متن کامل

A New Ring-Based SPHF and PAKE Protocol On Ideal Lattices

emph{ Smooth Projective Hash Functions } ( SPHFs ) as a specific pattern of zero knowledge proof system are fundamental tools to build many efficient cryptographic schemes and protocols. As an application of SPHFs, emph { Password - Based Authenticated Key Exchange } ( PAKE ) protocol is well-studied area in the last few years. In 2009, Katz and Vaikuntanathan described the first lattice-based ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997